Tangential frequency ltering decompositions
نویسنده
چکیده
In this paper, new robust algorithms for the solution of systems of linear equations which arise from the discretisation of partial diierential equations with strongly varying coeecients are introduced. These iterative methods are based on the tangential frequency ltering decompositions. The existence of the TFFD and the convergence of the induced iterative algorithms is shown for symmetric and positive deenite matrices. Convergence rates independent of the number of unknowns are proven for a smaller class of matrices. The adaptive test vector iterative method allows the combination of the tangential frequency decomposition (TFFD) and other iterative methods such as multi-grid. The connection with the TFFD improves the robustness of these iterative methods with respect to varying coeecients.
منابع مشابه
Filtering Decompositions with Respect to Adaptive Test Vectors
The adaptive ltering decompositions are based on the tangential frequency ltering decompositions (TFFD). During the iteration with a preliminary preconditioner, the adaptive test vector method calculates new test vectors for additional TFFDs. The adaptive test vector iterative method allows the combination of the tangential frequency decomposition and other iterative methods such as multi-grid....
متن کاملTangential Frequency Ltering Decompositions for Symmetric Matrices
The tangential frequency ltering decomposition (TFFD) is introduced. The convergence theory of an iterative scheme based on the TFFD for symmetric matrices is the focus of this paper. The existence of the TFFD and the convergence of the induced iterative algorithm is shown for symmetric and positive deenite matrices. Convergence rates independent of the number of unknowns are proven for a small...
متن کاملAdaptive Filtering
In this paper, the adaptive ltering method is introduced and analysed. This method leads to robust algorithms for the solution of systems of linear equations which arise from the discreti-sation of partial diierential equations with strongly varying coeecients. These iterative algorithms are based on the tangential frequency ltering decompositions (TFFD). During the iteration with a preliminary...
متن کاملOn traces for H(curl,Ω) in Lipschitz domains
We study tangential vector fields on the boundary of a bounded Lipschitz domain Ω in R3. Our attention is focused on the definition of suitable Hilbert spaces corresponding to fractional Sobolev regularities and also on the construction of tangential differential operators on the non-smooth manifold. The theory is applied to the characterization of tangential traces for the space H(curl,Ω). Hod...
متن کاملSignal subspace methods for speech enhancement
This thesis focus on the theory analysis and algorithm aspects of signal subspace methods used for speech enhancement in digital speech processing The problem is approached by initially performing an analysis of subspace principles applied to speech signals in order to characterize the usefulness of de ning a signal subspace for this application The theory is formulated by means of the singular...
متن کامل